منابع مشابه
The Secant Conjecture in the Real Schubert Calculus
We formulate the Secant Conjecture, which is a generalization of the Shapiro Conjecture for Grassmannians. It asserts that an intersection of Schubert varieties in a Grassmannian is transverse with all points real if the flags defining the Schubert varieties are secant along disjoint intervals of a rational normal curve. We present theoretical evidence for this conjecture as well as computation...
متن کاملThe Monotone Secant Conjecture in the Real Schubert Calculus
The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as c...
متن کاملTree Calculus for Bivariate Difference Equations
Abstract. Following Poupard’s study of strictly ordered binary trees with respect to two parameters, namely, “end of minimal chain” and “parent of maximum leaf” a true Tree Calculus is being developed to solve a partial difference equation system and then make a joint study of those two statistics. Their joint distribution is shown to be symmetric and to be expressed in the form of an explicit ...
متن کاملLambek Calculus Proofs and Tree Automata
We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of all proofs. While Lambek grammars can assign...
متن کاملTree Automata, Mu-calculus and Determinacy
We show that the propositional Mu-Calculus is equivalent in expressive p o wer to nite automata on inn-nite trees. Since complementation is trivial in the Mu-Calculus, our equivalence provides a radically sim-pliied, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results. We also show h o w Mu-Calculus can be used to e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2014
ISSN: 2391-5455
DOI: 10.2478/s11533-014-0429-7